Deciding equivalence of top–down XML transformations in polynomial time
نویسندگان
چکیده
منابع مشابه
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time
Many useful XML transformations can be formulated through deterministic top-down tree transducers. A canonical form for such transducers is presented which allows to decide equivalence of their induced transformations in polynomial time. If the transducer is total, the canonical form can be obtained in polynomial time as well.
متن کاملDeciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
We show that the equivalence of deterministic linear top-down treeto-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not necessarily order-preserving and can be used to express XML and other document transformations. The result is based on a partial normal form that provides a basic characterization of the languages produced by linear tree-t...
متن کاملA Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes
A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Parallel Processes: multisets of elementary processes combined by a commutative parallel-composition operator. 1 Discussion Consider a collection (actually a multiset) of \elementary processes," each of a nite number of diierent kinds. At any instant, one of the elementary processes may spontaneous...
متن کاملA Polynomial-Time Algorithm for Deciding Markov Equivalence of Directed Cyclic Graphical Models
Although the concept of d-separation was originally defined for directed acyclic graphs (see Pearl 1988), there is a natural extension of the concept to directed cyclic graphs. When exactly the same set of d-separation relations hold in two directed graphs, no matter whether respectively cyclic or acyclic, we say that they are Markov equivalent. In other words, when two directed cyclic graphs a...
متن کاملA Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes
A polynomial-time procedure is presented for deciding bisimilarity of normed context-free processes. It follows as a corollary that language equivalence of simple context-free grammars is decidable in polynomial time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2009
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2009.01.001